On the Behaviour of Extremal Optimisation When Solving Problems with Hidden Dynamics
نویسندگان
چکیده
Solving dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms. Due to its extremely simple functionality, it is likely that the algorithm can be applied successfully in such a dynamic environment. This document examines the capabilities of Extremal Optimisation to solve a dynamic problem with a large variety of different changes that are not explicitly announced to the solver.
منابع مشابه
Solving Problems with Hidden Dynamics - Comparison of Extremal Optimisation and Ant Colony System
dynamic combinatorial problems poses a particular challenge to optimisation algorithms. Optimising a dynamic problem that does not notify the solver when a change has been made is very difficult for most well-known algorithms. Extremal Optimisation is a recent addition to the group of biologically inspired optimisation algorithms, while Ant Colony System has been used to solve a large variety o...
متن کاملDynamic function optimisation with hybridised extremal dynamics
Dynamic function optimisation is an important research area because many real-world problems are inherently dynamic in nature. Over the years, a wide variety of algorithms have been proposed to solve dynamic optimisation problems, and many of these algorithms have used the Moving Peaks (MP) benchmark to test their own capabilities against other approaches. This paper presents a detailed account...
متن کاملEvolutionary Population Dynamics and Multi-Objective Optimisation Problems
Problems for which many objective functions are to be simultaneously optimised are widely encountered in science and industry. These multiobjective problems have also been the subject of intensive investigation and development recently for metaheuristic search algorithms such as ant colony optimisation, particle swarm optimisation and extremal optimisation. In this chapter, a unifying framework...
متن کاملThe comparison of two high-order semi-discrete central schemes for solving hyperbolic conservation laws
This work presents two high-order, semi-discrete, central-upwind schemes for computing approximate solutions of 1D systems of conservation laws. We propose a central weighted essentially non-oscillatory (CWENO) reconstruction, also we apply a fourth-order reconstruction proposed by Peer et al., and afterwards, we combine these reconstructions with a semi-discrete central-upwind numerical flux ...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کامل